光纤位移传感器在喷油器针阀升程测量中的应用

传统的柴油机喷油器针阀升程测量方式多为接触式.文中提出运用光纤位移传感器进行喷油器针阀升程的测量,重点介绍了光纤位移传感器的原理、测量系统的组成、检测电路的特点等.实践表明,光纤位移传感器在喷油器针阀升程测量中的运用,实现了非接触测量,测量精度大大提高.     

基于物联网的战地装备安全监管问题研究

针对战地环境中军事装备的安全监管问题,分析了战地装备安全监管应用系统的整体结构与功能层次,给出了基于RFID射频识别技术、无线传感器等物联网技术的硬件平台设计方案,以及基于数据采集、分析、融合、传输和可视化技术研发监管控制软件的实现方案。该系统部署应用后可实现对装备实时、连续、精确的分级监管,能够确保装备管理的安全和高效,提高部队指挥决策能力。     

Sensor placement in active multistatic sonar networks

The idea of deploying noncollocated sources and receivers in multistatic sonar networks (MSNs) has emerged as a promising area of opportunity in sonar systems. This article is one of the first to address point coverage problems in MSNs, where a number of points of interest have to be monitored in order to protect them from hostile underwater assets. We consider discrete “definite range” sensors as well as various diffuse sensor models. We make several new contributions. By showing that the convex hull spanned by the targets is guaranteed to contain optimal sensor positions, we are able to limit the solution space. Under a definite range sensor model, we are able to exclude even more suboptimal solutions. We then formulate a nonlinear program and an integer nonlinear program to express the sensor placement problem. To address the nonconvex single‐source placement problem, we develop the Divide Best Sector (DiBS) algorithm, which quickly provides an optimal source position assuming fixed receivers. Starting with a basic implementation of DiBS, we show how incorporating advanced sector splitting methods and termination conditions further improve the algorithm. We also discuss two ways to use DiBS to find multiple source positions by placing sensors iteratively or simultaneously. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 287–304, 2017     

Preemptive parallel‐machine scheduling with a common server to minimize makespan

We consider parallel‐machine scheduling with a common server and job preemption to minimize the makespan. While the non‐preemptive version of the problem is strongly NP‐hard, the complexity status of the preemptive version has remained open. We show that the preemptive version is NP‐hard even if there is a fixed number of machines. We give a pseudo‐polynomial time algorithm to solve the case with two machines. We show that the case with an arbitrary number of machines is unary NP‐hard, analyze the performance ratios of some natural heuristic algorithms, and present several solvable special cases. © 2017 Wiley Periodicals, Inc. Naval Research Logistics 64: 388–398, 2017     

结合景象匹配与惯导信息的SAR平台定位方法

利用高度传感器提供高度信息,结合高精度异源图像匹配技术与惯导系统漂移修正方法实现SAR平台定位。根据成像中间时刻SAR平台与SAR图像中心线上物点在水平面的投影共线的特性,在单帧图像中心线上均匀选取若干点与光学基准图进行高精度景象匹配;计算平台在水平面上投影位置,并利用高度信息确定其空间位置;使用序列图像定位结果估计惯导系统漂移参数,对惯导系统输出的位置数据进行修正,实现高精度的SAR平台定位。对各误差因素的影响进行分析,推导了精度估计公式。仿真和实际序列图像实验结果表明,方法正确可行,具有较高的平台定位精度,具备一定工程实用价值。     

基于景象匹配与惯导信息的SAR平台定位方法

利用高度传感器提供高度信息,结合高精度异源图像匹配技术与惯导系统漂移修正方法实现了SAR平台定位。根据成像中间时刻SAR平台与SAR图像中心线上物点在水平面的投影共线的特性,在单帧图像中心线上均匀选取若干点与光学基准图进行高精度景象匹配,计算平台在水平面上投影位置,并利用高度信息确定其空间位置;再使用序列图像定位结果估计惯导系统漂移参数,对惯导系统输出的位置数据进行修正,实现高精度的SAR平台定位。对各误差因素的影响进行了分析,推导了精度估计公式。仿真和实际序列图像实验结果表明,方法正确可行,平台定位精度较高,具备一定工程实用价值。     

Single machine scheduling with a restricted rate‐modifying activity

In this paper we consider the problem of scheduling a set of jobs on a single machine on which a rate‐modifying activity may be performed. The rate‐modifying activity is an activity that changes the production rate of the machine. So the processing time of a job is a variable, which depends on whether it is scheduled before or after the rate‐modifying activity. We assume that the rate‐modifying activity can take place only at certain predetermined time points, which is a constrained case of a similar problem discussed in the literature. The decisions under consideration are whether and when to schedule the rate‐modifying activity, and how to sequence the jobs in order to minimize some objectives. We study the problems of minimizing makespan and total completion time. We first analyze the computational complexity of both problems for most of the possible versions. The analysis shows that the problems are NP‐hard even for some special cases. Furthermore, for the NP‐hard cases of the makespan problem, we present a pseudo‐polynomial time optimal algorithm and a fully polynomial time approximation scheme. For the total completion time problem, we provide a pseudo‐polynomial time optimal algorithm for the case with agreeable modifying rates. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005     

Manpower allocation with time windows and job‐teaming constraints

In this work, we study manpower allocation with time windows and job‐teaming constraints. A set of jobs at dispersed locations requires teams of different types of workers where each job must be carried out in a preestablished time window and requires a specific length of time for completion. A job is satisfied if the required composite team can be brought together at the job's location for the required duration within the job's time window. The objective is to minimize a weighted sum of the total number of workers and the total traveling time. We show that construction heuristics used with simulated annealing is a good approach to solving this NP‐hard problem. In experiments, this approach is compared with solutions found using CPLEX and with lower bounds obtained from a network flow model. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005.     

基于自适应原理诊断传感器偏差故障的方法

在控制系统中 ,传感器是容易发生故障的部件 ,研究传感器故障诊断问题具有重要意义。介绍了一种基于自适应原理的传感器偏差故障诊断方法 ,首先将传感器偏差故障表示为系统状态 ,然后应用自适应原理估计出传感器偏差故障。仿真表明 ,用这种方法诊断传感器偏差故障是可行的。     

外卡式传感器特征参数的提取与分析

基于试验所检测到的压力波形,通过分析燃油喷射过程,提取了压力波形的特征参数,着重给出了特征点识别的新算法,井用MATLAB开发了相应软件。最后,根据识别结果,分析了调整参数对特征参数的影响。